Submodular function minimization and polarity

Using polarity, we give an outer polyhedral approximation for the epigraph of set functions. For a submodular function, prove that corresponding polar relaxation is exact; hence, it equivalent to Lovász extension. The approach provides alternative proof convex hull description function. Computational experiments show inequalities from approximations can be effective as cutting planes solving well non-submodular function minimization problems.